پیدا کردن بزرگترین و کوچکترین مقدار با لیستهای پیوندی

[NIIT]

کلاس:

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Collections;



namespace STUDENT

{

    public class Linklist

    {

        public node first = new node();

        public node current = new node();

        public node max = new node();

        public node min = new node();

       // public string print;

        public string more;

        public string less;

        public node b = new node();

        public bool a;

        public Linklist()

        {

            first = null;

            

        }

        public void add(string name,int id,int average)

        {

            node n = new node(name,id,average);

            

            if (first == null)

            {

                a = true;

                first = n;

                current = first;

            }

            else 

            {

                a = false;

                current = first;

                while (current.Next != null)

                current = current.Next;

                current.Next = n;

            }

        }

        

        public node FindMax()

        {

            current = first;

             max = current;

            while(current.Next!=null)

            {

                if (current.Next.Average > current.Average)

                {

                    max = current.Next;

                    current = current.Next;

                }

                else

                    current = current.Next;



            }

            return max;



        }

        public node FindMin()

        {

            current = first;

            min = current;

            while (current.Next != null) 

            {

                if (current.Next.Average < current.Average)

                {

                    min = current.Next;

                    current = current.Next;

                }

                else

                {

                    

                    current = current.Next;

                }

            }

            return min;



        }

        public string FindMore(int avg)

        {

            more = "";

            current = first;

            while (current!= null)

            {

                if (current.Average <= avg)

                    current = current.Next;

                else

                {

                    more = more + current.Name+" : "+current.Id+" / "+current.Average+"\n";

                    current = current.Next;

                }



            }

            return more;

            

        }

        public String FindLess(int avg)

        {

            less = "";

            current = first;

            while (current != null)

            {

                if (current.Average >= avg)

                    current = current.Next;

                else

                {

                    less = less + current.Name + " : " + current.Id + " / " + current.Average + "\n";

                    current = current.Next;

                }

            }

            return less;

        }

     

        

       

    }

}

فراخونی:

using System;

using System.Collections.Generic;

using System.ComponentModel;

using System.Data;

using System.Drawing;

using System.Linq;

using System.Text;

using System.Windows.Forms;

using System.Media;



namespace STUDENT

{

    public partial class Form1 : Form

    {

        public Form1()

        {

            InitializeComponent();



        }

        Linklist l = new Linklist();





        private void btnAdd_Click(object sender, EventArgs e)

        {



            if (txtName.Text != "" && txtId.Text != "")

            {

                string a = txtName.Text;

                int b = Convert.ToInt32(txtId.Text);

                int c = Convert.ToInt32(txtAv.Text);

                l.add(a, b, c);



                if (l.a == true)

                    r1.Text = l.current.Name + l.current.Id + l.current.Average;

                else if (l.a == false)

                    r1.Text = l.current.Next.Name + l.current.Next.Id + l.current.Next.Average;

                txtName.Text = "";

                txtId.Text = "";

                txtAv.Text = "";



            }

            else

                MessageBox.Show("please fill in the blanks first");

        }

        private void button3_Click(object sender, EventArgs e)

        {

            try

            {

                l.FindMax();

                txtMaxName.Text = l.max.Name;

                txtMaxId.Text = Convert.ToString(l.max.Id);

                txtMaxAv.Text = Convert.ToString(l.max.Average);

            }

            catch { }

        }



        private void button4_Click(object sender, EventArgs e)

        {

            try

            {

                l.FindMin();

                txtMinName.Text = l.min.Name;

                txtMinId.Text = Convert.ToString(l.min.Id);

                txtMinAv.Text = Convert.ToString(l.min.Average);

            }

            catch { }

        }



        private void button7_Click(object sender, EventArgs e)

        {

            if (txtMore.Text == "")

                MessageBox.Show("Insert the average first");

            else

            {

                l.FindMore(Convert.ToInt32(txtMore.Text));

                r3.Text = l.more;

            }



        }



        private void button8_Click(object sender, EventArgs e)

        {

            if (txtLess.Text == "")

                MessageBox.Show("Insert the average first");

            else

            {

                l.FindLess(Convert.ToInt32(txtLess.Text));

                r3.Text = l.less;

            }

        }





    

        



       



    }

}

سوالی بود ،بفرمایین
بااحترام

موضوعات مشابه:

• پیشنهاد2
• اشاره گر به لیست بدون استفاده از لیست پیوندی
• لیست تک پیوندی -list peyvandi
• آدم‌هاي برنده شبیه شما نیستند!